Convex Optimization for Rendezvous and Proximity Operation via Birkhoff Pseudospectral Method

Rapid and accurate rendezvous proximity operations for spacecraft are crucial to the success of most space missions. In this paper, a sequential convex programming method, combined with first-order second-order Birkhoff pseudospectral methods, is proposed autonomous spacecraft. The original nonlinear nonconvex close-range problem thrust constraints no-fly zone converted into its version by using convexification techniques; then, method used transcribe dynamic series linear algebraic equality constraints, in other words, conic relatively small condition number. Thus, resulting can be accurately efficiently solved solver. simulation results indicate that especially have obvious advantages over methods computational efficiency sensitivity.